Optimal Triangulation of Saddle Surfaces
نویسنده
چکیده
We consider the piecewise linear approximation of saddle functions of the form f(x, y) = ax − by under the L∞ error norm. We show that interpolating approximations are not optimal. One can get slightly smaller errors by allowing the vertices of the approximation to move away from the graph of the function.
منابع مشابه
Fabrication of Saddle-Shaped Surfaces by Flame Forming Process
The flame forming process is widely used to manufacture ship hull plates. The saddle-shaped surfaces have different curvatures in perpendicular angles of planes and the manufacturers face an anti-clastic curvature. In this article, the manufacturing of saddle-shaped surfaces utilizing the flame forming process is investigated. The spiral irradiating scheme is used for forming. In order to study...
متن کاملCurvature Matrix Models for Dynamical Triangulations and the Itzykson-Di Francesco Formula
We study the large-N limit of a class of matrix models for dually weighted triangulated random surfaces using character expansion techniques. We show that for various choices of the weights of vertices of the dynamical triangulation the model can be solved by resumming the Itzykson-Di Francesco formula over congruence classes of Young tableau weights modulo three. From this we show that the lar...
متن کاملRemarks on the quantum gravity interpretation of 4D dynamical triangulation
Here the path integral is over real metrics modulo coordinate transformations, G denotes a renormalized Newton constant and the · · · indicate higher derivative terms like R, etc. There may also be nonlocal terms related to the conformal anomaly [2]. The integral over μ produces the volume fixing delta function δ( ∫ dx √ g − V ). If this integral were done in the saddle point approximation, the...
متن کاملFunction approximation on triangular grids: some numerical results using adaptive techniques
Applications of mesh adaption techniques could be found in the numerical solution of PDE’s or in the optimal triangulation of surfaces for shape representation or graphic display. The scope of this work is to verify through numerical experiments the effectiveness of some algorithms for the control of the L∞ error norm for piece–wise linear approximation on 2D unstructured triangular meshes. The...
متن کاملScene Simpli®cation TOPOLOGY PRESERVING DATA SIMPLIFICATION WITH ERROR BOUNDS
ÐMany approaches to simpli®cation of triangulated terrains and surfaces have been proposed which permit bounds on the error introduced. A few algorithms additionally bound errors in auxiliary functions de®ned over the triangulation. We present an approach to simpli®cation of scalar ®elds over unstructured grids which preserves the topology of functions de®ned over the triangulation, in addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017